Entropy-constrained halftoning using multipath tree coding

نویسنده

  • Ping Wah Wong
چکیده

We suggest an optimization-based method for halftoning that involves looking ahead before a decision for each binary output pixel is made. We first define a mixture distortion criterion that is a combination of a frequency-weighted mean square error (MSE) and a measure depending on the distances between minority pixels in the halftone. A tree-coding approach with the ML-algorithm is used for minimizing the distortion criterion to generate a halftone. While this approach generates halftones of high quality, these halftones are not very amenable to lossless compression. We introduce an entropy constraint into the cost function of the tree-coding algorithm that optimally trades off between image quality and compression performance in the output halftones.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model-based digital image halftoning using iterative reduced-complexity grid message-passing algorithm

An iterative grid message-passing algorithm for model-based digital image halftoning is introduced. Based on the standard message-passing algorithm on the grid graphical model, the algorithm is designed to suboptimally solve general two-dimensional (2D) digital least metric (DLM) problems and is found to be very successful (i.e., nearly optimal) for 2D data detection in page-oriented optical-me...

متن کامل

Simplified grid message-passing algorithm with application to digital image halftoning

Based on message-passing techniques, a novel iterative grid algorithm for the general two-dimensional (2D) digital least metric (DLM) problem is proposed and applied to image halftoning. The algorithm attempts to achieve a globally optimal solution via a local computation and message passing. This concept is different from many 2D iterative optimization techniques such as simulated annealing an...

متن کامل

Conditional Entropy Constrained Tree Structured Vector Quantization with Applications to Sources with Memory

An algorithm is derived for designing tree structured vector quantizers to encode sources with memory The algorithm minimizes the average distortion subject to a conditional entropy constraint and the tree structure restriction This technique called conditional entropy constrained tree structured vector quantization CECTSVQ can more e ciently exploit the source memory This work is an extension ...

متن کامل

A binary noisy channel to model errors in printing process

To model printing noise a binary noisy channel and a set of controlled gates are introduced. The channel input is an image created by a halftoning algorithm and its output is the printed picture. Using this channel robustness to noise between halftoning algorithms can be studied. We introduced relative entropy to describe immunity of the algorithm to noise and tested several halftoning algorithms.

متن کامل

Inverse halftoning by decision tree learning

Inverse halftoning is the process to retrieve a (gray) continuous-tone image from a halftone. Recently, machinelearning-based inverse halftoning techniques have been proposed. Decision-tree learning has been applied with success to various machine-learning applications for quite some time. In this paper, we propose to use decision-tree learning to solve the inverse halftoning problem. This allo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society

دوره 6 11  شماره 

صفحات  -

تاریخ انتشار 1997